Multi-Agent Planning under Uncertainty with Monte Carlo Q-Value Function
نویسندگان
چکیده
منابع مشابه
Monte Carlo Motion Planning for Robot Trajectory Optimization Under Uncertainty
This article presents a novel approach, named MCMP (Monte Carlo Motion Planning), to the problem of motion planning under uncertainty, i.e., to the problem of computing a low-cost path that fulfills probabilistic collision avoidance constraints. MCMP estimates the collision probability (CP) of a given path by sampling via Monte Carlo the execution of a reference tracking controller (in this pap...
متن کاملMulti-Agent Planning under Uncertainty with Rare Catastrophic Events
This dissertation abstract outlines some of theoretical frameworks for modeling and simulation of multi-agent planning problems with rare catastrophic events. In particular, this abstract will focus on a wildfire surveillance application using unmanned aircraft. The thesis abstract presents an initial model and results of a preliminary study.
متن کاملMulti-agent Monte Carlo Go
In this paper we propose a Multi-Agent version of UCT Monte Carlo Go. We use the emergent behavior of a great number of simple agents to increase the quality of the Monte Carlo simulations, increasing the strength of the artificial player as a whole. Instead of one agent playing against itself, different agents play in the simulation phase of the algorithm, leading to a better exploration of th...
متن کاملReasoning Under Uncertainty: Some Monte Carlo Results
A series of monte carlo studies were performed to compare the behavior of some alternative procedures for reasoning under uncertainty. The behavior of several Bayesian, linear model and default reasoning procedures were examined in the context of increasing levels of calibration error. The most interesting result is that Bayesian procedures tended to output more extreme posterior belief values ...
متن کاملHierarchical Monte-Carlo Planning
Monte-Carlo Tree Search, especially UCT and its POMDP version POMCP, have demonstrated excellent performance on many problems. However, to efficiently scale to large domains one should also exploit hierarchical structure if present. In such hierarchical domains, finding rewarded states typically requires to search deeply; covering enough such informative states very far from the root becomes co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2019
ISSN: 2076-3417
DOI: 10.3390/app9071430